A Lower Ordered Hmm Approach to Blind Sequence Estimation

نویسندگان

  • Yi Sun
  • Lang Tong
چکیده

In this paper, the base-band signal collected ~rom an unknown, multipath, multi-receiver FIR channel IS viewed as a state sequence generated by a hidden Markov model (HMM) whose states and order are unknown and whose transition probability matrix with an unknown permutation is known once the order is given. Based on this view, two types of algorithms are developed ,for acquisit~on and tracking, respectively. The algorithms are suitable for both block and non-block transmissions, and for tzme-varying channek. For acquisition, the states and the transition probability matrix of a fully-connected HMM with a poss~ble lower order are estimated by using a clustering algorithm. Then a state sequence is estimated based on a maximum a posterior (MAP) esttmator usang the Vzterbi algorithm with a ,fully-connected trellis. Thzs state sequence is used to refine the estimated states and transdton pro babdit y matmx o,f the HMM. Based on the ,fzdly-connect ed HMM, the states are properly assigned to symbol vectors and the non-, fillyconnected HMM is detemin.ed, whzch is used m the maz~mum kkelzhood (ML) sequence estzmatzon.. In tracking, the symbol sequence zs estzmated by the Viterbi algorzthm, and the states of the HMM are updated at each release o,f estzmated states. Simulation result shows that the proposed blind algorithms with the lower-ordered HMM achieve the performance comparable with the ML estimator utilizing the known channel parameters. Theoretical analysis con@ms simulation results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequence analysis EBSeq-HMM: a Bayesian approach for identifying gene-expression changes in ordered RNA-seq experiments

Motivation: With improvements in next-generation sequencing technologies and reductions in price, ordered RNA-seq experiments are becoming common. Of primary interest in these experiments is identifying genes that are changing over time or space, for example, and then characterizing the specific expression changes. A number of robust statistical methods are available to identify genes showing d...

متن کامل

EBSeq-HMM: a Bayesian approach for identifying gene-expression changes in ordered RNA-seq experiments

MOTIVATION With improvements in next-generation sequencing technologies and reductions in price, ordered RNA-seq experiments are becoming common. Of primary interest in these experiments is identifying genes that are changing over time or space, for example, and then characterizing the specific expression changes. A number of robust statistical methods are available to identify genes showing di...

متن کامل

BLIND PARAMETER ESTIMATION OF A RATE k/n CONVOLUTIONAL CODE IN NOISELESS CASE

This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...

متن کامل

A New Fast and Efficient HMM-Based Face Recognition System Using a 7-State HMM Along With SVD Coefficients

In this paper, a new Hidden Markov Model (HMM)-based face recognition system is proposed. As a novel point despite of five-state HMM used in pervious researches, we used 7-state HMM to cover more details. Indeed we add two new face regions, eyebrows and chin, to the model. As another novel point, we used a small number of quantized Singular Values Decomposition (SVD) coefficients as feature...

متن کامل

On the inclusion of channel's time dependence in a hidden Markov model for blind channel estimation

In this paper, the theory of hidden Markov models (HMM) is applied to the problem of blind (without training sequences) channel estimation and data detection. Within a HMM framework, the Baum–Welch (BW) identification algorithm is frequently used to find out maximum-likelihood (ML) estimates of the corresponding model. However, such a procedure assumes the model (i.e., the channel response) to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998